Construction of large families of pseudo-random binary sequences

نویسندگان

  • Louis GOUBIN
  • Christian MAUDUIT
چکیده

In a series of papers Mauduit and S arkozy (partly with coauthors) studied nite pseudorandom binary sequences. They showed that the Legendre symbol forms a \good" pseudorandom sequence, and they also tested other sequences for pseudorandomness, however, no large family of \good" pseudorandom sequences has been found yet. In this paper, a large family of this type is constructed. Again, the construction is related to the Legendre symbol. Moreover, by using elliptic curves large families of binary sequences are constructed. It is expected that these sequences form \good" pseudorandom binary sequences. 1991 Mathematics Subject Classi cation : 11 K 45.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

'Good' Pseudo-Random Binary Sequences from Elliptic Curves

Some families of binary sequences are constructed from elliptic curves. Such sequences are shown to be of strong pseudorandom properties with ‘small’ well-distribution measure and ‘small’ correlation measure of ‘small’ order, both of which were introduced by Mauduit and Sárközy to analyze the pseudo-randomness of binary sequences.

متن کامل

Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map

A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and auto-correlation are investigated. All these properties of the sequences suggest a strong resemblance to random sequences. Results of statistical testing of the seq...

متن کامل

Families of p-ary sequences with low correlation and large linear complexity

This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.

متن کامل

Can Dynamic Neural Filters Produce Pseudo-Random Sequences?

Dynamic neural filters (DNFs) are recurrent networks of binary neurons. Under proper conditions of their synaptic matrix they are known to generate exponentially large cycles. We show that choosing the synaptic matrix to be a random orthogonal one, the average cycle length becomes close to that of a random map. We then proceed to investigate the inversion problem and argue that such a DNF could...

متن کامل

New construction for families of binary sequences with optimal correlation properties

In this correspondence, we present a construction, in a closed form, for an optimal family of 2m binary sequences of period 2 1 with respect to Welch’s bound, whenever there exists a balanced binary sequence of period 2m 1 with ideal autocorrelation property using the trace function. This construction enables us to reinterpret a small set of Kasami and No sequences as a family constructed from ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002